Degrees of Degrees

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

s-Degrees within e-Degrees

For any enumeration degree a let D a be the set of s-degrees contained in a. We answer an open question of Watson by showing that if a is a nontrivial Σ2-enumeration degree, then D a has no least element. We also show that every countable partial order embeds into D a.

متن کامل

CHARACTERIZATIONS OF (L;M)-FUZZY TOPOLOGY DEGREES

In this paper, characterizations of the degree to which a mapping $mathcal{T} : L^{X}longrightarrow M$ is an $(L, M)$-fuzzy topology are studied in detail.What is more, the degree to which an $L$-subset is an $L$-open set with respect to $mathcal{T}$ is introduced.Based on that, the degrees to which a mapping $f: Xlongrightarrow Y$ is continuous,open, closed or a quotient mapping with respect t...

متن کامل

Degrees of Efficiency and Degrees of Minimality

In this work we characterize different types of solutions of a vector optimization problem by means of a scalarization procedure. Usually different scalarizing functions are used in order to obtain the various solutions of the vector problem. Here we consider different kinds of solutions of the same scalarized problem. Our results allow us to establish a parallelism between the solutions of the...

متن کامل

Degrees of Truth, Degrees of Falsity

In this paper I recall the reasons in favour of extending the classical conception of truth to include degrees of truth as well as truth value gaps and gluts, then provide a sketch of a new system of logic that provides all of these simultaneously. Despite its power, the resulting system is quite simple, combining degrees of truth and degrees of falsity to provide a very flexible and elegant co...

متن کامل

Degrees That Are Not Degrees of Categoricity

A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B ∼= A there is an isomorphism f : B → A with f ≤T x. A degree x is a degree of categoricity if there is a computable structure A such that A is x-computably categorical, and for all y, if A is y-computably categorical then x ≤T y. We construct a Σ2 set whose degree is not a degree o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the Burgon Society

سال: 2020

ISSN: 2475-7799

DOI: 10.4148/2475-7799.1171